Answer Extraction as Sequence Tagging with Tree Edit Distance
نویسندگان
چکیده
Our goal is to extract answers from preretrieved sentences for Question Answering (QA). We construct a linear-chain Conditional Random Field based on pairs of questions and their possible answer sentences, learning the association between questions and answer types. This casts answer extraction as an answer sequence tagging problem for the first time, where knowledge of shared structure between question and source sentence is incorporated through features based on Tree Edit Distance (TED). Our model is free of manually created question and answer templates, fast to run (processing 200 QA pairs per second excluding parsing time), and yields an F1 of 63.3% on a new public dataset based on prior TREC QA evaluations. The developed system is open-source, and includes an implementation of the TED model that is state of the art in the task of ranking QA pairs.
منابع مشابه
Record Extraction Using Record Segmentation Tree
In spite of extensive study of information extraction from web pages, the existing methods fail to extract all the data from the web pages. Also, the existing methods divide the data extraction into two phases, namely, record region detection and record segmentation. In this paper, we proposed a unified method for data extraction from a structured web page. We propose a new search structure Rec...
متن کاملRecognizing Textual Entailment with Tree Edit Distance: Application to Question Answering and Information Extraction
This thesis addresses the problem of Recognizing Textual Entailment (i.e. recognizing that the meaning of a text entails the meaning of another text) using a Tree Edit Distance algorithm between the syntactic trees of the two texts. A key aspect of the approach is the estimation of the cost for the editing operations (i.e. Insertion, Deletion, Substitution) among words. Our aim is to compare th...
متن کاملLearning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured documents. In this context, many applications require the calculation of similarities between tree pairs. The most studied distance is likely the tree edit distance (ED) for which improvements in terms of complexity ...
متن کاملEdit Distance for XML Information Retrieval: Some Experiments on the Datacentric Track of INEX 2011
In this paper we present our structured information retrieval model based on subgraphs similarity. Our approach combines a content propagation technique which handles sibling relationships with a document query matching process on structure. The latter is based on tree edit distance (TED) which is the minimum set of insert, delete, and replace operations to turn one tree to another. As the effe...
متن کاملTree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)
The edit distance between two rooted ordered trees with n nodes labeled from an alphabet Σ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit dist...
متن کامل